A Biochemical Calculus Based on Strategic Graph Rewriting

نویسندگان

  • Oana Andrei
  • Hélène Kirchner
چکیده

Graphs are suitable for describing the structure of complex systems and graph transformations for modeling their dynamic evolution. We are interested in a particular representation of molecular complexes as graphs and of reaction patterns as graph transformations: • the behavior of a protein is given by its functional domains / sites on the surface • two proteins can interact by binding or changing the states of sites • bound proteins form complexes that have a graph-like structure •membranes can also form molecular complexes, called tissues

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategic Port Graph Rewriting for Autonomic Computing

In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We show that this formalism is suitable for modeling autonomic systems and we illustrate its expressivity for modeling properties of such systems using an example of a mail delivery system.

متن کامل

A Higher-Order Graph Calculus for Autonomic Computing

In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems.

متن کامل

Rewrite Rules and Strategies for Molecular Graphs

In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules and generation of biochemical networks based on the representation of molecular complexes as a particular type of multigraphs with ports called molecular graphs. The advantage of this approach is to obtain for free a rewriting calculus which allows defining at the same level transformati...

متن کامل

A Graph Rewriting Semantics for the Polyadic Calculus

We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.

متن کامل

The Graph Rewriting Calculus: Confluence and Expressiveness

Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that uniformly integrates termrewriting and λ-calculus. The ρg-calculus has been recently introduced as an extension of the ρ-calculus, handling structures with cycles and sharing. The calculus over terms is naturally generalized by using unification constraints in addition to the standard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008